On Primal-Dual Circle Representations
نویسندگان
چکیده
The Koebe-Andreev-Thurston Circle Packing Theorem states that every triangulated planar graph has a circle-contact representation. The theorem has been generalized in various ways. The arguably most prominent generalization assures the existence of a primal-dual circle representation for every 3-connected planar graph. The aim of this note is to give a streamlined proof of this result.
منابع مشابه
Circle Packings of Maps in Polynomial Time
The Andreev-Koebe-Thurston circle packing theorem is generalized and improved in two ways. First, we get simultaneous circle packings of the map and its dual map so that, in the corresponding straight-line representations of the map and the dual, any two edges dual to each other are perpendicular. Necessary and sufficient condition for a map to have such a primal-dual circle packing representat...
متن کاملPrimal-dual Circle packing of Planar Maps
This work is based on Mohar [1]’s recent algorithm for circle packing for the Euclean case. We implement his polynomial time algorithm for constructing primal-dual circle packings of almost 3-connected planar maps. We have improved Mohar’s algorithm and have been able to get near an order of magnitude speed up for large graphs. We describe our implementation in C/C++ style pseudo-code.
متن کاملPrimal-dual path-following algorithms for circular programming
Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...
متن کاملAccurate Circle Conngurations and Numerical Conformal Mapping in Polynomial Time
| According to a remarkable re-interpretation of a theorem of E.M. Andreev (1970) by W.P. Thurston (1982), there is a unique (up to inversive transformations) packing of interior-disjoint circles in the plane, whose contact graph is any given polyhedral graph G, and such that an analagous \dual" circle packing simultaneously exists, whose contact graph is the planar dual graph G , and such that...
متن کاملCircle Packings of Maps - the Euclidean Case
In an earlier work, the author extended the AndreevKoebe-Thurston circle packing theorem. Additionally, a polynomial time algorithm for constructing primal-dual circle packings of arbitrary (essentially) 3-connected maps was found. In this note, additional details concerning surfaces of constant curvature 0 (with special emphasis on planar graphs where a slightly different treatment is necessar...
متن کامل